Computational Aspects of M-grammars

In this paper M-grammars tha t are used in the Roset ta t ranslat ion system will be looked at as the specification of a t t r ibu te grammars. We will show tha t the a t t r ibute evaluation order is such tha t instead of the special-purpose parsing and generation algorithms introduced for M-grammars in Appelo et al.(1987), also Earley-like context-free parsing and ordinary generation strategies can be used. Furthermore, i t is i l lustrated tha t the a t t r ibu te grammar approach gives an insight into the weak generative capacity of M-grammars and into the computat ional complexity of the parsing and generation process. Finally, the a t t r ibute grammar approach will be used to reformulate the concept of isomorphic grammars.